Elitism and Distance Strategy for Selection of Evolutionary Algorithms
نویسندگان
چکیده
منابع مشابه
A Unified Model for Multi-Objective Evolutionary Algorithms with Elitism
Though it has been claimed that elitism could improve evolutionary multi-objective search significantly, a thorough and extensive evaluation of its effects is still missing. Guidelines on how elitism could successfully be incorporated have not yet been developed. This paper presents a unified model of multi-objective evolutionary algorithms, in which arbitrary variation and selection operators ...
متن کاملThe Role of Elitism in Multiobjective Optimization with Evolutionary Algorithms
This paper studies the influence of elitism in Evolutionary Multiobjective Optimization. The true efficiency of inserting elitism in these algorithms was not yet sufficiently developed. Many algorithms for multiobjective optimization use different methods to keep the best individuals (the elite) founded on the duration of the search process. The problem is how this elitism can be preserved and,...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولSelection Methods for Evolutionary Algorithms
3.1 Fitness Proportionate Pelection (FPS) 3.2 Windowing 3.3 Sigma Scaling 3.4 Linear Scaling 3.5 Sampling Algorithms 3.6 Ranking 3.7 Linear Ranking 3.8 Exponential Ranking 3.9 Tournament Selection 3.10 Genitor or Steady State Models 3.11 Evolution Strategy and Evolutionary Programming Methods 3.12 Evolution Strategy Approaches 3.13 Top-n Selection 3.14 Evolutionary Programming Methods 3.15 The ...
متن کاملElitism-based compact genetic algorithms
This paper describes two elitism-based compact genetic algorithms (cGAs)—persistent elitist compact genetic algorithm (pe-cGA), and nonpersistent elitist compact genetic algorithm (ne-cGA). The aim is to design efficient compact-type GAs by treating them as estimation of distribution algorithms (EDAs) for solving difficult optimization problems without compromising on memory and computation cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2861760